The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tommaso Bolognesi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tommaso Bolognesi, Ed Brinksma
    Introduction to the ISO Specification Language LOTOS. [Citation Graph (1, 0)][DBLP]
    Computer Networks, 1987, v:14, n:, pp:25-59 [Journal]
  2. Tommaso Bolognesi, Egon Börger
    Abstract State Processes. [Citation Graph (0, 0)][DBLP]
    Abstract State Machines, 2003, pp:22-32 [Conf]
  3. Egon Börger, Tommaso Bolognesi
    Remarks on Turbo ASMs for Functional Equations and Recursion Schemes. [Citation Graph (0, 0)][DBLP]
    Abstract State Machines, 2003, pp:218-228 [Conf]
  4. Tommaso Bolognesi, Andrea Bracciali
    Formal specification of discrete systems by active predicates and dynamic constraints (Short Paper). [Citation Graph (0, 0)][DBLP]
    FMOODS, 1999, pp:- [Conf]
  5. Tommaso Bolognesi, Maurizio Caneve
    Squiggles - A Tool for the Analysis of LOTOS Specifications. [Citation Graph (0, 0)][DBLP]
    FORTE, 1988, pp:201-216 [Conf]
  6. Tommaso Bolognesi, Giuseppe Ciaccio
    Cumulating constraints on the "WHEN" and the "WHAT". [Citation Graph (0, 0)][DBLP]
    FORTE, 1993, pp:433-448 [Conf]
  7. Tommaso Bolognesi, David de Frutos-Escrig, Yolanda Ortega-Mallén
    Graphical Composition Theorems for Parallel and Hiding Operators. [Citation Graph (0, 0)][DBLP]
    FORTE, 1990, pp:459-470 [Conf]
  8. Tommaso Bolognesi, Ferdinando Lucidi
    LOTOS-like Process Algebras with Urgent or Timed Interactions. [Citation Graph (0, 0)][DBLP]
    FORTE, 1991, pp:249-264 [Conf]
  9. Tommaso Bolognesi
    The electric power of LOTOS - Results of a joint academic/industrial experiment. [Citation Graph (0, 0)][DBLP]
    FORTE, 1992, pp:431-446 [Conf]
  10. Tommaso Bolognesi
    Composing Event Constraints in State-Based Specification. [Citation Graph (0, 0)][DBLP]
    FORTE, 2004, pp:13-32 [Conf]
  11. Tommaso Bolognesi
    A Graphical Composition Theorem for Networks of Lotos Processes. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1990, pp:88-95 [Conf]
  12. Tommaso Bolognesi
    A Conceptual Framework for State-Based and Event-Based Formal Behavioural Specification Languages. [Citation Graph (0, 0)][DBLP]
    ICECCS, 2004, pp:107-116 [Conf]
  13. Tommaso Bolognesi
    What happens? On notions of event in formal methods and elsewhere. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2002, pp:1-3 [Conf]
  14. Tommaso Bolognesi, Ferdinando Lucidi, Sebastiano Trigila
    From timed Petri nets to timed LOTOS. [Citation Graph (0, 0)][DBLP]
    PSTV, 1990, pp:395-408 [Conf]
  15. Tommaso Bolognesi, Harry Rudin
    On the Analysis of Time-Dependent Protocols by Network Flow Algorithms. [Citation Graph (0, 0)][DBLP]
    PSTV, 1984, pp:491-513 [Conf]
  16. Tommaso Bolognesi, Scott A. Smolka
    Fundamental Results for the Verification of Observational Equivalence: A Survey. [Citation Graph (0, 0)][DBLP]
    PSTV, 1987, pp:165-179 [Conf]
  17. Tommaso Bolognesi, Ferdinando Lucidi
    Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1991, pp:124-148 [Conf]
  18. Tommaso Bolognesi, Diego Latella, Elisabetta Zuppa
    Non-standard Interpretations of LOTOS Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.2, 1991, pp:217-234 [Conf]
  19. Tommaso Bolognesi
    Expressive Flexibility of a Constraint-Oriented Notation. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1997, v:40, n:5, pp:277-259 [Journal]
  20. Tommaso Bolognesi, Olof Hagsand, Diego Latella, Björn Pehrson
    The Definition of a Graphical G-LOTOS Editor Using the Meta-Tool LOGGIE. [Citation Graph (0, 0)][DBLP]
    Computer Networks and ISDN Systems, 1991, v:22, n:1, pp:61-77 [Journal]
  21. Tommaso Bolognesi, Elie Najm, Paul A. J. Tilanus
    G-LOTOS: A Graphical Language for Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Computer Networks and ISDN Systems, 1994, v:26, n:9, pp:1101-1127 [Journal]
  22. Tommaso Bolognesi
    Process Algebra Under the Light of Wolfram's NKS. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:101-105 [Journal]
  23. Tommaso Bolognesi
    Regrouping Parallel Processes. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1996, v:9, n:3, pp:263-302 [Journal]
  24. Joost-Pieter Katoen, Rom Langerak, Ed Brinksma, Diego Latella, Tommaso Bolognesi
    A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1998, v:12, n:2, pp:189-216 [Journal]
  25. Tommaso Bolognesi, John Derrick
    Constraint-oriented style for object-oriented formal specification. [Citation Graph (0, 0)][DBLP]
    IEE Proceedings - Software, 1998, v:145, n:2-3, pp:61-70 [Journal]
  26. Tommaso Bolognesi
    Deriving Graphical Representations of Process Networks from Algebraic Expressions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:6, pp:289-294 [Journal]
  27. Tommaso Bolognesi
    Predicates for state changes vs. processes for event patterns. [Citation Graph (0, 0)][DBLP]
    Stud. Inform. Univ., 2004, v:3, n:1, pp:85-124 [Journal]
  28. Tommaso Bolognesi, John Derrick
    Introduction. [Citation Graph (0, 0)][DBLP]
    Software and System Modeling, 2005, v:4, n:3, pp:234-235 [Journal]
  29. Tommaso Bolognesi, Franco Accordino
    A Layer on Top of Prolog for Composing Behavioural Constraints. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1998, v:28, n:13, pp:1415-1435 [Journal]
  30. Tommaso Bolognesi
    Toward Constraint-Object-Oriented Development. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2000, v:26, n:7, pp:594-616 [Journal]
  31. Tommaso Bolognesi
    Planar Trivalent Network Computation. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:146-157 [Conf]
  32. Tommaso Bolognesi
    Behavioral complexity indicators for process algebra: The NKS approach. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:72, n:1, pp:50-77 [Journal]

  33. Causal sets from simple models of computation [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.042secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002