kenichi taniguchi - Citegraph

Author Info

Name	Affiliation	Papers
KENICHI TANIGUCHI	Osaka Univ, Dept Info & Math Sci, Toyonaka, Osaka 5608531, Japan	45
Collaborators	Citations	PageRank
54	256	35.56
Referers	Referees	References
368	475	294

Search Limit

100475

Publications (45 rows)

Collaborators (54 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Symbolic model checking of extended finite state machines with linear constraints over integer variables	3	0.49	2006
An autonomous and decentralized protocol for delay sensitive overlay multicast tree	7	0.52	2004
Cost-Conscious Geographic Multicast On Manet	8	0.80	2004
A Receiver Coordination Protocol for the Efficient Use of Bandwidth in Distributed Multimedia Applications	0	0.34	2003
A Language for Describing Wireless Mobile Applications with Dynamic Establishment of Multi-way Synchronization Channels	2	0.53	2002
Formal Verification of CPU in Laboratory Work	0	0.34	2001
A compiler to implement LOTOS specifications in distributed environments	4	0.59	2001
Hardware implementation of Concurrent Periodic EFSM's	4	0.50	2000
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference	1	0.35	2000
Hardware implementation of communication protocols modeled by concurrent EFSMs with multi-way synchronization	14	0.90	2000
Specification of real-time systems using a timed automata model with shared variables and verification of partial-deadlock freeness	3	0.44	1999
Receiver-Cooperative Bandwidth Management for Layered Multicast	2	0.41	1999
Formal design verification for correctness of pipelined microprocessors with out-of-order instruction execution	0	0.34	1999
Generating Test Cases for a Timed I/O Automaton Model	74	2.48	1999
Resource management for quality of service guarantees in multi-party multimedia application	3	0.50	1998
Hardware synthesis from protocol specifications in LOTOS	7	0.72	1998
Protocol Synthesis from Time Petri Net Based Service Specification	4	0.44	1997
Implementation of Distributed Systems described with LOTOS Multi-rendezvous on Bus Topology Networks	1	0.37	1997
Proof method for correctness of refinements of algebraic specification in abstract sequential machine style	1	0.57	1996
Time-action alternating model for timed LOTOS and its symbolic verification of bisimulation equivalence	3	0.41	1996
A LOTOS Compiler Generating Multi-threaded Object Codes	10	1.00	1995
Verification of Liveness Property for Communicating FSM's with Conditional Transitions Depending on State Visiting Numbers	0	0.34	1995
Hardware synthesis from a restricted class of LOTOS expressions	1	0.41	1994
Software process description using LOTOS and its enaction	9	0.61	1994
Automatic Correctness Proof of the Implementation of Synchronous Sequential Circuits Using an Algebraic Approach	4	0.65	1994
Deriving protocol specifications from service specifications in extended FSM models	12	0.91	1993
A graph editor for large trees with browsing and zooming capabilities	0	0.34	1993
LOTOS enhancement to specify time constraint among non-adjacent actions using first order logic	5	0.47	1993
VTM: A Graph Editor for Large Trees	2	0.45	1992
Test System for a Restricted Class of LOTOS Expressions with Data Parameters	5	0.60	1992
ASL program written in abstract sequential machine style and its compiler	1	0.82	1992
Automated Verification of Equivalence of Protocol Machines	2	0.44	1989
Principles of algebraic language ASL.	3	0.96	1987
Decision problem concerning security for cryptographic protocols.	1	0.42	1987
Compiling and optimizing methods for the functional language ASL/F	7	1.86	1986
Optimization of functional language ASL/F programs.	1	0.87	1985
Membership Problems For Data Dependencies In Relational Expressions	5	0.39	1984
An Algebraic Specification of HDLC Procedures and Its Verification	11	2.12	1984
Membership Problem For Embedded Multivalued Dependencies Under Some Restricted Conditions	1	0.85	1983
Decision Problems For Multivalued Dependencies In Relational Databases	27	6.16	1979
On equivalence of safe Petri nets	0	0.34	1979
A Result on the Equivalence Problem for Deterministic Pushdown Automata	5	0.96	1976
An O(n) Algorithm for Computing the Set of Available Expressions of D-Charts.	1	0.70	1976
Reduction of Context-Free Grammars	0	0.34	1970
A Note on Computing Time for the Recognition of Context-Free Languages by a Single-Tape Turing Machine	2	0.54	1969